Fast Approximation of the H∞ Norm via Optimization over Spectral Value Sets
نویسندگان
چکیده
The H∞ norm of a transfer matrix of a control system is the reciprocal of the largest value of ε such that the associated ε-spectral value set is contained in the stability region for the dynamical system (the left half-plane in the continuous-time case and the unit disk in the discrete-time case). We extend an algorithm recently introduced by Guglielmi and Overton [GO11] for approximating the maximal real part or modulus of points in a matrix pseudospectrum to spectral value sets, characterizing its fixed points. We then introduce a Newton-bisection method to approximate the H∞ norm, for which each step requires optimization of the real part or the modulus over an ε-spectral value set. The algorithm is much faster than the standard Boyd-Balakrishnan-BruinsmaSteinbuch algorithm to compute the H∞ norm when the system matrices are large and sparse and the number of inputs and outputs is small. The main work required by the algorithm is the computation of the spectral abscissa or radius of a sequence of matrices that are rank-one perturbations of a sparse matrix.
منابع مشابه
Hybrid Expansion-contraction: a Robust Scaleable Method for Approximating the H∞ Norm
We present a new scaleable algorithm for approximating the H∞ norm, an important robust stability measure for linear dynamical systems with input and output. Our spectral value set based method uses a novel hybrid expansion-contraction scheme that, under reasonable assumptions, is guaranteed to converge to a stationary point of the optimization problem defining the H∞ norm, and, in practice, ty...
متن کاملFast Approximation of the H∞ Norm via Hybrid Expansion-contraction Using Spectral Value Sets
The H∞ norm is a well known and important measure arising in many applications that quantifies the least amount of perturbation a linear dynamical system with inputs and outputs can incur such that it may no longer be asymptotically stable. Calculating it is an expensive proposition of finding a global optimum of a nonconvex and nonsmooth optimization problem, and while the standard algorithm b...
متن کاملRobust and efficient methods for approximation and optimization of stability measures
We consider two new algorithms with practical application to the problem of designing controllers for linear dynamical systems with input and output: a new spectral value set based algorithm called hybrid expansion-contraction intended for approximating the H∞ norm, or equivalently, the complex stability radius, of large-scale systems, and a new BFGS SQP based optimization method for nonsmooth,...
متن کاملFast algorithms for solving H,-norm minimization problems
H,-norm of the approximation error for both methods satisfies 16, 91 In this paper we propose an efficient computational a p rn proach to minimize the H,-norm of a transfer-function OT+I 5 /IG(s) G,(s)/Im 1 2 x ai (2) matrix depending affinely on a set of free parame.=?+I ters. The minimization problem, formulated as a semiinfinite convex programming problem, is solved via a where > . . . > 0, ...
متن کاملA Smoothing Technique for the Minimum Norm Solution of Absolute Value Equation
One of the issues that has been considered by the researchers in terms of theory and practice is the problem of finding minimum norm solution. In fact, in general, absolute value equation may have infinitely many solutions. In such cases, the best and most natural choice is the solution with the minimum norm. In this paper, the minimum norm-1 solution of absolute value equation is investigated. ...
متن کامل